package day5.LC509;



public class Main {
    public static void main(String[] args) {

    }
}


class Solution {
    public int fib(int n) {
        int[] dp = new int[n+1];
        dp[0]=0;
        dp[1]=1;
        for (int i = 2; i <= n; i++) {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
}